Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations
نویسندگان
چکیده
We present a compositional method which allows to overapproximate the set of attractors and under-approximate the set of basins of attraction of a Boolean network (BN). This merely consists in replacing a global fixed-point computation by a composition of local fixedpoint computations. Once these approximations have been computed, it becomes much more tractable to generate the exact sets of attractors and basins of attraction. We illustrate the interest of our approach on several examples, among which is a BN modeling a railway interlocking system with 50 nodes and millions of attractors.
منابع مشابه
Negative local feedbacks in Boolean networks
We study the asymptotic dynamical properties of Boolean networks without local negative cycle. While the properties of Boolean networks without local cycle or without local positive cycle are rather well understood, recent literature raises the following two questions about networks without local negative cycle. Do they have at least one fixed point? Should all their attractors be fixed points?...
متن کاملStrong Convergence of the Iterations of Quasi $phi$-nonexpansive Mappings and its Applications in Banach Spaces
In this paper, we study the iterations of quasi $phi$-nonexpansive mappings and its applications in Banach spaces. At the first, we prove strong convergence of the sequence generated by the hybrid proximal point method to a common fixed point of a family of quasi $phi$-nonexpansive mappings. Then, we give applications of our main results in equilibrium problems.
متن کاملHydraulic Analysis of Water Supply Networks using a Modified Hardy Cross Method
There are different methods for the hydraulic analysis of water supply networks. In the solution process of most of these methods, a large system of linear equations is solved in each iteration. This usually requires a high computational effort. Hardy Cross method is one of the approaches that do not need such a process and may converge to the solution through scalar divisions. However, this me...
متن کاملDynamical Behavior and Influence of Stochastic Noise on Certain Generalized Boolean Networks
This study considers a simple Boolean network with N nodes, each node’s state at time t being determined by a certain number of parent nodes. The network is analyzed when the connectivity k is fixed or variable. Making use of a Boolean rule that is a generalization of Rule 22 of elementary cellular automata, a generalized formula for providing the probability of finding a node in state 1 at a t...
متن کاملCRFA-CRBM: a hybrid technique for anomaly recognition in regional geochemical exploration; case study: Dehsalm area, east of Iran
Identification of geochemical anomalies is a significant step during regional geochemical exploration. In this matter, new techniques have been developed based on deep learning networks. These simple-structure-networks act like our brains on processing the data by simulating deep layers of thinking. In this paper, a hybrid compositional-deep learning technique was applied to identify the anomal...
متن کامل